Best lower and upper bounds for the Randić index R−1 of chemical trees
نویسندگان
چکیده
The general Randić index Rα(G) of a graph G is defined as the sum of the weights (d(u)d(v)) α of all edges uv of G, where d(u) denotes the degree of a vertex u in G and α is an arbitrary real number. Clark and Moon gave the lower and upper bounds for the Randić index R −1 of all trees, and posed the problem to determine better bounds. In this paper we give the best possible lower and upper bounds for R −1 among all chemical trees, i.e., trees with maximum degree at most 4. Some (but not all) of the corresponding tree structures are also determined.
منابع مشابه
An Upper Bound on the First Zagreb Index in Trees
In this paper we give sharp upper bounds on the Zagreb indices and characterize all trees achieving equality in these bounds. Also, we give lower bound on first Zagreb coindex of trees.
متن کاملChemical Trees with Extreme Values of Zagreb Indices and Coindices
We give sharp upper bounds on the Zagreb indices and lower bounds on the Zagreb coindices of chemical trees and characterize the case of equality for each of these topological invariants.
متن کاملSharp Bounds on the PI Spectral Radius
In this paper some upper and lower bounds for the greatest eigenvalues of the PI and vertex PI matrices of a graph G are obtained. Those graphs for which these bounds are best possible are characterized.
متن کاملOn the lower and upper bounds for general Randić index of chemical (n,m)-graphs
A chemical (n,m)-graph is a connected graph of order n, size m and maximum degree at most 4. The general Randić index of a graph is defined as the sum of the weights [d(u)d(v)]α of all edges uv of the graph, where α is any real number and d(u) is the degree of a vertex u. In this paper, we give the lower and upper bounds for general Randić index of chemical (n,m)-graphs. A graph of order n and ...
متن کاملOn the first variable Zagreb index
The first variable Zagreb index of graph $G$ is defined as begin{eqnarray*} M_{1,lambda}(G)=sum_{vin V(G)}d(v)^{2lambda}, end{eqnarray*} where $lambda$ is a real number and $d(v)$ is the degree of vertex $v$. In this paper, some upper and lower bounds for the distribution function and expected value of this index in random increasing trees (rec...
متن کامل